The Impact of Output Selection Function Choice on the Performance of Adaptive Wormhole Routing

نویسنده

  • Loren Schwiebert
چکیده

Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the output selection function (routing policy) affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for a fully adaptive mesh routing algorithm. The simulation results show that the choice of selection function has a significant effect on the average message latency. Thus, a naive implementation of an adaptive routing algorithm may lead to poor performance. These selection functions are also compared with a theoretically optimal selection function [1]. We show that although theoretically optimal, the actual performance of the optimal selection function is not best. An explanation and interpretation of the results is provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion estimation of router input ports in Network-on-Chip for efficient virtual allocation

Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...

متن کامل

A Performance Evaluation of Fully Adaptive Wormhole Routing including Selection Function Choice

Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for four different fully adaptive wormhole routing algorithms fo...

متن کامل

A two-phase wormhole attack detection scheme in MANETs

Mobile ad-hoc networks (MANETs) have no fixed infrastructure, so all network operations such as routing and packet forwarding are done by the nodes themselves. However, almost all common existing routing protocols basically focus on performance measures regardless of security issues. Since these protocols consider all nodes to be trustworthy, they are prone to serious security threats. Wormhole...

متن کامل

A Secure Routing Algorithm for Underwater Wireless Sensor Networks

Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...

متن کامل

An analytical model of adaptive wormhole routing with time-out

Several studies have shown that the performance advantages of adaptive routing over deterministic routing are reduced when the traffic contains strong degree of communication locality. This paper proposes a new analytical model of an adaptive routing algorithm proposed by Duato in [Dua94]. The main feature of this algorithm is the use of a time-out selection function for assigning virtual chann...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997